Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets
نویسندگان
چکیده
E C 33 34 35 36 37 38 39 40 41 42 43 44 45 46 Article history: Received 21 May 2008 Received in revised form 1 May 2009 Accepted 1 May 2009 Available online xxxx
منابع مشابه
A New Concise Representation of Frequent Patterns through Disjunctive Search Space
The interest in a further pruning of the set of frequent patterns that can be drawn from real-life datasets is growing up. In fact, it is a quite survival reflex towards providing a manageably-sized and reliable knowledge. This fact is witnessed by the proliferation of what is called concise representation of frequent patterns. In this paper, we propose an exact concise representation that expl...
متن کاملExploring the Disjunctive Search Space towards Discovering New Exact Concise Representations for Frequent Patterns
Extracting concise representations seems to be a milestone towards the emerging knowledge extraction field. In fact, it is a quite survival reflex towards providing a manageably-sized and reliable knowledge. Thus, we bashfully witness the emergence of a trend towards extracting concise representations, e.g., closed patterns, non-derivable patterns and essential patterns. The essential pattern-b...
متن کاملA New Concise and Lossless Representation of Frequent Itemsets Using Generators and A Positive Border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representations have been proposed to eliminate the redundancy. Existing generator based representations rely on a negative border to make the representation lossless. However, negative borders of generators are often very large...
متن کاملOptimized Mining of a Concise Representation for Frequent Patterns based on Disjunctions Rather than Conjunctions
Exact condensed representations were introduced in order to offer a small-sized set of elements from which the faithful retrieval of all frequent patterns is possible. In this paper, a new exact concise representation only based on particular elements from the disjunctive search space will be introduced. In this space, a pattern is characterized by its disjunctive support, i.e., the frequency o...
متن کاملMining All Non-derivable Frequent Itemsets
Recent studies on frequent itemset mining algorithms resulted in significant performance improvements. However, if the minimal support threshold is set too low, or the data is highly correlated, the number of frequent itemsets itself can be prohibitively large. To overcome this problem, recently several proposals have been made to construct a concise representation of the frequent itemsets, ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Data Knowl. Eng.
دوره 68 شماره
صفحات -
تاریخ انتشار 2009